Semi-algebraic Ideas in Nonsmooth Optimization
نویسنده
چکیده
Modern variational analysis provides a sophisticated unification of convex and smooth optimization theory, achieving striking generality but at the expense of possible pathology. The general theory must handle highly irregular and oscillatory functions and sets, and yet, on the other hand, a rich family of concrete instances involve no such pathology. In particular, from a variety of variational-analytic perspectives, semialgebraic sets—finite unions of sets defined by finitely many polynomial inequalities—are well behaved.
منابع مشابه
Generalized Derivatives of Differential-Algebraic Equations
Nonsmooth equation-solving and optimization algorithms which require local sensitivity information are extended to systems with nonsmooth parametric differential-algebraic equations embedded. Nonsmooth differential-algebraic equations refers here to semi-explicit differential-algebraic equations with algebraic equations satisfying local Lipschitz continuity and differential right-hand side func...
متن کاملA General Scalar-Valued Gap Function for Nonsmooth Multiobjective Semi-Infinite Programming
For a nonsmooth multiobjective mathematical programming problem governed by infinitely many constraints, we define a new gap function that generalizes the definitions of this concept in other articles. Then, we characterize the efficient, weakly efficient, and properly efficient solutions of the problem utilizing this new gap function. Our results are based on $(Phi,rho)-$invexity,...
متن کاملCurves of Descent
Steepest descent is central in variational mathematics. We present a new transparent existence proof for curves of near-maximal slope — an influential notion of steepest descent in a nonsmooth setting. We moreover show that for semi-algebraic functions — prototypical nonpathological functions in nonsmooth optimization — such curves are precisely the solutions of subgradient dynamical systems.
متن کاملAn Inertial Tseng's Type Proximal Algorithm for Nonsmooth and Nonconvex Optimization Problems
We investigate the convergence of a forward-backward-forward proximal-type algorithm with inertial and memory effects when minimizing the sum of a nonsmooth function with a smooth one in the absence of convexity. The convergence is obtained provided an appropriate regularization of the objective satisfies the KurdykaLojasiewicz inequality, which is for instance fulfilled for semi-algebraic func...
متن کاملNonsmooth Differential-algebraic Equations
A nonsmooth modeling paradigm for dynamic simulation and optimization of process operations is advocated. Nonsmooth differential-algebraic equations (DAEs) naturally model a wide range of physical systems encountered in chemical engineering conventionally viewed as exhibiting hybrid continuous/discrete behavior. Due to recent advancements in nonsmooth analysis, nonsmooth DAEs now have a suitabl...
متن کامل